Relating Chi to Hybrid Automata
نویسندگان
چکیده
A hybrid automaton is one of the most popular formal models for hybrid system specification. The Chi language is a hybrid formalism for modeling, simulation and verification. It consists of a number of operators that operate on all process terms, including differential algebraic equations. This paper relates the two formalisms by means of a formal translation from a hybrid automaton model to a Chi model, and a comparison of the semantics of the two models in terms of their respective transition systems. The comparison is illustrated by means of three examples: a thermostat, a railroad gate controller, and dry friction.
منابع مشابه
Relating Hybrid Chi to Other Formalisms
The hybrid χ (Chi) formalism is suited to modeling, simulation and verification of hybrid systems. It integrates concepts from dynamics and control theory with concepts from computer science, in particular from process algebra and hybrid automata. In this paper, we first provide an overview of χ. Then, the χ formalism is related to other formalisms by means of translation schemes: a translation...
متن کاملFORMAL VERIFICATION OF CHI MODELS USING PHAVer
The hybrid Chi (χ) language is a formalism for modeling, simulation and verification of hybrid systems. One of the most widely known hybrid system formalisms is that of hybrid automata. The formal translation of χ to hybrid automata enables verification of χ specifications using existing hybrid automata based verification tools. In this paper, we describe the translation from χ to hybrid automa...
متن کاملSyntax and consistent equation semantics of hybrid Chi
The hybrid χ (Chi) formalism integrates concepts from dynamics and control theory with concepts from computer science, in particular from process algebra and hybrid automata. It integrates ease of modeling with a straightforward, structured operational semantics. Its 'consistent equation semantics' enforces state changes to be consistent with invariants as in most hybrid automata. Ease of model...
متن کاملGenerating Discrete Trace Transition System of a Polyhe-dral Invariant Hybrid Automaton
Supervisory control and fault diagnosis of hybrid systems need to have complete information about the discrete states transitions of the underling system. From this point of view, the hybrid system should be abstracted to a Discrete Trace Transition System (DTTS) and represented by a discrete mode transition graph. In this paper an effective method is proposed for generating discrete mode trans...
متن کاملSyntax and Formal Semantics of Chi 2.0
This report defines the syntax and formal semantics of the Chi 2.0 formalism. The Chi formalism integrates concepts from dynamics and control theory with concepts from computer science, in particular from process algebra and hybrid automata. It combines a high expressivity and ease of modeling with a formal semantics. The Chi language is defined by means of an abstract and a concrete syntax. Th...
متن کامل